Combining Decomposition and Unfolding for STG Synthesis

نویسندگان

  • Victor Khomenko
  • Mark Schäfer
چکیده

For synthesising efficient asynchronous circuits one has to deal with the state space explosion problem. In this paper, we present a combined approach to alleviate it, based on using Petri net unfoldings and decomposition. The experimental results show significant improvement in terms of runtime compared with other existing methods.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Synthesis of Speed-Independent Circuits from STG-unfolding Segment1

This paper presents a novel technique for synthesis of speed-independent circuits. It is based on partial order representation of the state graph called STG-unfolding segment. The new method uses approximation technique to speed up the synthesis process. The method is illustrated on the basic implementation architecture. Experimental results demonstrating its efficiency are presented and discus...

متن کامل

STG Decomposition and Its Correctness∗

The behaviour of asynchronous control circuits can be specified with Signal Transition Graphs (STGs), i.e. Petri nets where transitions are labelled with rising and falling edges of circuit signals. Speed independent (SI) circuits (an important and robust subclass of asynchronous circuits) can be synthesized from STGs with tools like PETRIFY [3] and PUNF&MPSAT [6]. For this purpose, PETRIFY bui...

متن کامل

COMPUTING SCIENCE Logic Decomposition of Asynchronous Circuits Using STG Unfoldings

A technique for logic decomposition of asynchronous circuits which works on STG unfolding prefixes rather than state graphs is proposed. It retains all the advantages of the state space based approach, such as the possibility of multiway acknowledgement, latch utilisation and highly optimised circuits. Moreover, it significantly alleviates the state space explosion, and thus has superior memory...

متن کامل

Interactive Resolution of Encoding Conflicts in Asynchronous Circuits Based on STG Unfoldings

The synthesis of asynchronous circuits from STGs involves the resolution of encoding conflicts by means of refining the STG specification. The refinement process is generally done automatically using heuristics and offers little or no feedback to the designer making it difficult to intervene. Better synthesis solutions are obtained by involving human knowledge into the process. A framework is p...

متن کامل

Interactive Synthesis of Asynchronous Systems based on Partial Order Semantics

An interactive synthesis of asynchronous circuits from Signal Transition Graphs (STGs) based on partial order semantics is presented. In particular, the fundamental problem of encoding con icts in the synthesis is tackled, using partial orders in the form of STG unfolding pre xes. They o er a compact representation of the reachable state space and have the added advantage of simple structures. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007